Self-Adaptive Differential Evolution for Dynamic Environments with Fluctuating Numbers of Optima
نویسندگان
چکیده
Despite the fact that evolutionary algorithms often solve static problems successfully, dynamic optimization problems tend to pose a challenge to evolutionary algorithms [21]. Differential evolution (DE) is one of the evolutionary algorithms that does not scale well to dynamic environments due to lack of diversity [35]. A significant body of work exists on algorithms for optimizing dynamic problems (see Section 1.3). Recently, several algorithms based on DE have been proposed [19][26][28][27][10]. Benchmarks used to evaluate algorithms aimed at dynamic optimization (like the moving peaks benchmark [5] and the generalized benchmark generator [17] [16]), typically focus on problems where a constant number of optima moves around a multi-dimensional search space. While some of these optima may be obscured by others, these benchmarks do not simulate problems where new optima are introduced, or current optima are removed from the search space. Dynamic Population DE (DynPopDE) [27] is a DE-based algorithm aimed at dynamic optimization problems where the number of optima fluctuates over time. This chapter describes the subcomponents of DynPopDE and then investigates the effect of hybridizing DynPopDE with the self-adaptive component of jDE [10] to form a new algorithm, Self-Adaptive DynPopDE (SADynPopDE). The following sections describe dynamic environments and the benchmark function used in this study. Related work by other researchers is presented in Section 1.3. Differential evolution is described in Section 1.4. The components of DynPopDE, the base algorithm used in this study, are described and motivated in Section 1.5. The incorporation of self-adaptive control parameters into DynPopDE to form SA-
منابع مشابه
Differential evolution for dynamic environments with unknown numbers of optima
This paper investigates optimization in dynamic environments where the numbers of optima are unknown or fluctuating. The authors present a novel algorithm, Dynamic Population Differential Evolution (DynPopDE), which is specifically designed for these problems. DynPopDE is a Differential Evolution based multi-population algorithm that dynamically spawns and removes populations as required. The n...
متن کاملA Differential Evolution and Spatial Distribution based Local Search for Training Fuzzy Wavelet Neural Network
Abstract Many parameter-tuning algorithms have been proposed for training Fuzzy Wavelet Neural Networks (FWNNs). Absence of appropriate structure, convergence to local optima and low speed in learning algorithms are deficiencies of FWNNs in previous studies. In this paper, a Memetic Algorithm (MA) is introduced to train FWNN for addressing aforementioned learning lacks. Differential Evolution...
متن کاملTuning of Extended Kalman Filter using Self-adaptive Differential Evolution Algorithm for Sensorless Permanent Magnet Synchronous Motor Drive
In this paper, a novel method based on a combination of Extended Kalman Filter (EKF) with Self-adaptive Differential Evolution (SaDE) algorithm to estimate rotor position, speed and machine states for a Permanent Magnet Synchronous Motor (PMSM) is proposed. In the proposed method, as a first step SaDE algorithm is used to tune the noise covariance matrices of state noise and measurement noise i...
متن کاملDeveloping Adaptive Differential Evolution as a New Evolutionary Algorithm, Application in Optimization of Chemical Processes
متن کامل
Reactive Power Dispatch Based on Self-Adaptive Differential Evolution Hybrid Particle Swarm Optimization
Reactive power dispatch, which may have many local optima, is an important and challenging task in the operation and control of electric power system. This paper presents a Selfadapti ve Differential Evolution hybrid Particle Swarm (SaDEPS) optimization algorithm for optimal reactive power dispatch problem. In this method, each particle is updated by a randomly selected strategy from a candidat...
متن کامل